Equivalence between Frequency Domain Blind Source Separation and Adaptive Beamforming
نویسندگان
چکیده
Frequency domain Blind Source Separation (BSS) is shown to be equivalent to two sets of Adaptive Beamformers (ABFs). The minimization of the off-diagonal components in the BSS update equation can be viewed as the minimization of the mean square error in the ABF. The unmixing matrix of the BSS and the filter coefficients of the ABF converge to the same solution in the mean square error sense if the two source signals are ideally independent. Therefore, the performance of the BSS is limited by that of the ABF. This understanding gives an interpretation of BSS from physical point of view.
منابع مشابه
Equivalence between Frequency-Domain Blind Source Separation and Frequency-Domain Adaptive Beamforming for Convolutive Mixtures
Frequency-domain blind source separation (BSS) is shown to be equivalent to two sets of frequency-domain adaptive beamformers (ABFs) under certain conditions. The zero search of the off-diagonal components in the BSS update equation can be viewed as the minimization of the mean square error in the ABFs. The unmixing matrix of the BSS and the filter coefficients of the ABFs converge to the same ...
متن کاملBlind Source Separation of Convolutive Mixtures of Speech in Frequency Domain
This paper overviews a total solution for frequencydomain blind source separation (BSS) of convolutive mixtures of audio signals, especially speech. Frequency-domain BSS performs independent component analysis (ICA) in each frequency bin, and this is more efficient than time-domain BSS. We describe a sophisticated total solution for frequency-domain BSS, including permutation, scaling, circular...
متن کاملEquivalence between Frequency Domain Blind Source Separation and Frequency Domain Adaptive Beamformers
Frequency domain Blind Source Separation (BSS) is shown to be equivalent to two sets of frequency domain adaptive microphone arrays, i.e., Adaptive Beamformers (ABF). The minimization of the off-diagonal components in the BSS update equation can be viewed as the minimization of the mean square error in the ABF. The unmixing matrix of the BSS and the filter coefficients of the ABF converge to th...
متن کاملEquivalence between frequency domain blind source separation and frequency domain adaptive null beamformers
Frequency domain Blind Source Separation (BSS) is shown to be equivalent to two sets of frequency domain adaptive microphone arrays, i.e., Adaptive Null Beamformers (ANB). The minimization of the off-diagonal components in the BSS update equation can be viewed as the minimization of the mean square error in the ANB. The unmixing matrix of the BSS and the filter coefficients of the ANB converge ...
متن کاملBlind source separation for speech based on fast-convergence algorithm with ICA and beamforming
We propose a new algorithm for blind source separation (BSS), in which independent component analysis (ICA) and beamforming are combined to resolve the low-convergence problem through optimization in ICA. The proposed method consists of the following three parts: (1) frequency-domain ICA with direction-of-arrival (DOA) estimation, (2) null beamforming based on the estimated DOA, and (3) integra...
متن کامل